Multi-pattern matching with bidirectional indexes ☆ ☆Preliminary version of this article appeared in COCOON 2012 [12].

This article originally appeared in:

The powerful illusion of a unified, Cartesian self responsible for intentional action is contrasted with the biologically sounder model of competitive processes that yield an only partially coherent agency, and the existence of the illusion of self is explained as an evolved feature of communicating agents, capable of responding to requests and queries about their own decisions and actions.

Improved-Bidirectional Exact Pattern Matching

In this research, we present an improved version of Bidirectional (BD) exact pattern matching (EPM) algorithm to solve the problem of exact pattern matching. Improved-Bidirectional (IBD) exact pattern matching algorithm introduced a new idea of scanning partial text window (PTW) as well with the pattern to take decision of moving pattern to the right of partial text window. IBD algorithm compar...

Entropy-Compressed Indexes for Multidimensional Pattern Matching

In this talk, we will discuss the challenges involved in developing a multidimensional generalizations of compressed text indexing structures. These structures depend on some notion of Burrows-Wheeler transform (BWT) for multiple dimensions, though naive generalizations do not enable multidimensional pattern matching. We study the 2D case to possibly highlight combinatorial properties that do n...

This work originally appeared in:

Multi-pattern Matching with Wildcards

Multi-pattern matching with wildcards is to find all the occurrences of a set of patterns with wildcards in a text. This problem arises in various fields, such as computational biology and network security. But the problem is not extensively studied as the single pattern case and there is no efficient algorithm for this problem. In this paper, we present efficient algorithms based on the fast F...